An Extended VDM Refinement Relation

نویسندگان

  • Morten Elvang-Gøransson
  • Bob Fields
چکیده

The original de nition of re nement proof obligations in VDM is reviewed and examples are discussed which while being in tuitively sensible pose problems for this de nition of re nement An extended VDM re nement relation is introduced to cope with the prob lems Some non standard applications of the extended re nement proof obligations are discussed

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using the Vienna Development Method (VDM) to Formalize a Communication Protocol

The Vienna Development Method (VDM) is based upon iterative refinement of formal specifications written in the model-oriented specification language, Meta-IV. VDM is also an informal collection of experiences in formal specification within several application domains. This paper provides an example of how VDM might be used in the area of communications, a new domain for VDM.

متن کامل

Vdm and the Refinement Calculus: a Comparison of Two Systematic Design Methods Vdm and the Reenement Calculus: a Comparison of Two Systematic Design Methods

This paper compares VDM and the Reenement Calculus as methods for deriving executable code from formal speciications. Two existing VDM case studies are recast in the Reenement Calculus style to illustrate the comparison. One case study illustrates operation decomposition or procedural reenement while the other is an example of data reiication or data reenement.

متن کامل

On the Verification of VDM Specification and Refinement with PVS

Although the formal method VDM has been in existence since the 1970’s, there are still no satisfactory tools to support verification in VDM. This paper deals with one possible means of approaching this problem by using the PVS theorem-prover. It describes a translation of a VDM-SL specification into the PVS specification language using, essentially, the very transparent translation methods desc...

متن کامل

Total-Correctness Refinement for Sequential Reactive Systems

We introduce a coinductively-defined refinement relation on sequential non-deterministic reactive systems that guarantees total correctness. It allows the more refined system to both have less non-determinism in its outputs and to accept more inputs than the less refined system. Data reification in VDM is a special case of this refinement. Systems are considered at what we have called fine and ...

متن کامل

The Transformational Paradigm as a Means of Smoothing Abrupt Software Design Steps

Current state-of-the-art methods and specification languages devised for software design have not yet accomplished a completely satisfactory calculus of formal rules enabling a smooth, deductive style of software development. Experience has shown evidence that the so-called refinement steps are hard to achieve in practice because too much intuition and craft are expected from the software desig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994